Method, system and computer program product for dynamically pricing perishable goods

ABSTRACT

Techniques for dynamically pricing perishable goods. The objective is to sell all items before any remaining items become worthless. The method comprises: monitoring a time parameter T corresponding to period T 0  to T n ; if T&lt;T n , periodically updating current price P current  for an item; in response client&#39;s interest, offering a temporarily fixed price P freeze =P current  for a freeze period ΔT freeze ; updating P current  in response to offering the fixed price P freeze ; accepting a purchase order for the item at P freeze  if purchase order received within the freeze period ΔT freeze ; rejecting the purchase order after the freeze period ΔT freeze ; updating P current  in response to receiving an accepted and/or rejected order; and repeating at least some of the above the acts until T equals maximum time Tn.

PARENT CASE INFORMATION

The present invention is a Continuation of copending application Ser.No. 14/316,394, filed on Jun. 26, 2014, which is a Continuation-in-PartApplication based on U.S. Non-Provisional application Ser. No.13/246,062 (published as 2012/0084173), filed on Sep. 27, 2011, whichclaims the benefit of U.S. Provisional Application No. 61/386,589 filedon Sep. 27, 2010, all of which are hereby expressly incorporated byreference into the present application.

TECHNICAL FIELD

The present invention relates to a method, computer program product andsystem for dynamically pricing goods, such as items of perishable goods.

BACKGROUND

Methods and systems of different complexity for pricing products exist.These methods and systems take into account the price sensitivity ofcustomers. The price sensitivity is then used to establish salesstrategies which seek to maximize revenue.

Since the price sensitivity of customers depends of numerous factors, ofwhich many are difficult to predict or even totally unknown, a productis often priced incorrectly. If the price is set too low, this normallyhas the effect that the product is sold out too quickly. For the sellerthis means that he or she will lose revenue since a higher average pricewould most likely have been possible to achieve. If the price of theproduct is set too high, some or all of the products will remain unsold,which might translate into lost revenues for the seller. The risk ofmispricing is especially high for perishable goods (e.g. transportation,events, and accommodation), since their value perishes at a certainpoint in time.

Incorrect pricing is often a result of having predetermined prices, asthese fail to encompass actual demand. The effects of incorrect pricinghave been experienced by almost every one of us in our daily lives.Sold-out or half-full airplanes, movie theatres, music concerts, as wellas grocery stores shelves filled with expired provisions are allexamples of prices being set either too low or too high. Even if somesteps towards more demand-driven pricing have been taken by for instancegranting last-minute discounts on tickets and the like, such methods arenormally based on predetermining prices based on historical data and/orthe practical experience of the seller. Consequently, there is a need todevelop better techniques for pricing perishable goods.

SUMMARY OF THE DISCLOSURE

Towards satisfaction of this need, the present invention provides amethod, a computer program product and system for dynamically pricingperishable goods.

According to an aspect, this is provided by a method, which comprisesperforming a pricing process for perishable goods on a programmed dataprocessing apparatus,

wherein the programmed data processing apparatus comprises a memorysystem for storing program code instructions and data, a processingsystem configured to execute at least some of the program codeinstructions and to process the data stored in the memory system, andwherein the processing system is operatively coupled to a databasesystem,

wherein the database system stores information on a plurality of itemsof goods,

wherein the memory system comprises program code instructions forcausing the processing system to carry out the pricing process, whereinthe pricing process comprises the following acts for each of a pluralityof items of goods:

a) monitoring a time parameter T corresponding to the time period fromT₀ to T_(n) when an item of goods is good for sale, and if the timeparameter T<T_(n);

b) periodically updating a current price P_(current) for the item ofgoods;

c) in response to receiving an indication of interest to buy the item ofgoods, offering a temporarily fixed price P_(freeze) equal to currentprice P_(current) for a freeze time period ΔT_(freeze);

d) automatically updating the current price P_(current) in response tooffering a temporarily fixed price P_(freeze);

e) accepting a purchase order for the item of goods at the temporarilyfixed price P_(freeze) if the purchase order is received within thefreeze time period ΔT_(freeze);

f) rejecting the purchase order if it is received after the freeze timeperiod ΔT_(freeze);

g) automatically updating the current price P_(current) of the item ofgoods in response to receiving an accepted and/or rejected order; and

automatically repeating the acts b through g until the time parameter Tequals the maximum time T_(n).

The so-called “limited time period” is typically a strictly limited timeperiod.

According to another aspect of the present invention, there is provideda computer program product comprising computer-readable mediumcomprising code for causing a computer system to perform theabove-identified acts.

According to yet another aspect of the present invention, there isprovided a data processing system. The data processing system isspecifically adapted to carry out the method according to the invention,by virtue of a database system and a memory system, wherein the databasesystem stores information related to registered items of goods, inparticular perishable items of goods, are stored, wherein the databasesystem further stores the registered items of goods for sale offered ona virtual marketplace, as well as updated information relative to thecontents.

The invention and/or its embodiments offer specific advantages in thefield of pricing perishable items of goods or products, since the priceof the items of goods is dynamically updated in accordance to the realdemand with the objective of selling all of the items of goods for salebefore the point in time any remaining items of goods become worthless.More efficient pricing will result in benefits for all parties yieldingthe seller greater revenues and the customers a product supply bettersuited for the demand. This means better allocation of resources in theeconomy; i.e. more use, less waste.

Perishable items of goods, or in other words “perishable goods”, bytheir nature become worthless at a certain point in time regardlesswhether they are used or not. Therefore it is important to rapidly pricethe items correctly as the time available for finding out the truedemand function is sharply limited; this is especially true for the caseof perishable goods. A dynamically adjusted price allocates thepurchases more evenly over time and therefore make better use of theeconomic resources (for example, IT infrastructure and customerservices). Examples of perishable goods include but are not limited to:transportation (e.g. airline, bus, ferry, and train tickets), events(e.g. game, concert, and movie tickets), accommodation (e.g. hotelrooms), rental (e.g. car hire), and provisions (food, beverage, etc.)

Instead of taking into account the underlying factors which influencesthe price sensitivity of the customers, by means of the method, computerprogram product and system according to the present invention, thecustomers' behaviors are registered, measured and analyzed by theinformation extractable from the interaction between price and demand.The customer's price sensitivity is then used by the invention withoutknowing the underlying factors that influence and drive the customers'price sensitivity. The method and system according to the presentinvention discovers the real need from the extracted information anddynamically updates the price thereafter.

Moreover, a minimum of presumptions has to be made since the informationregarding the demand is derived from both when there is no sale and whenthere is a sale. The price is updated every time there is buyinginterest, an accepted order, a rejected order, and at the end of eachtime interval.

Some implementations of the invention emphasize the fact that this priceis in fact a dynamic price, so that customers are aware that the pricecould change and also what sort of rules are valid for this sort ofcommerce, for example how long the current price is valid, so thecustomers feel safe with this. It is preferred that this communication,or dialog, with the customers is plain and straightforward in order toachieve full acceptance for the concept of dynamic pricing of perishablegoods in the public on a large scale.

BRIEF DESCRIPTION OF THE DRAWINGS

In the following section, specific embodiments of the invention will bedescribed in greater detail in connection with illustrative butnon-restrictive examples. A reference is made to the following drawings:

FIG. 1 shows an illustrative but non-restrictive implementation for adata processing system specifically adapted to carry out a methodaccording to the invention;

FIG. 2 illustrates a governing node (server) of the dynamic pricingsystem shown in FIG. 1;

FIG. 3 illustrates a flow-chart of a method according to an embodimentof the present invention;

FIG. 4 is a graph illustrating how a dynamic price is set; and

FIG. 5 is a graph illustrating how a dynamic price is set.

DETAILED DESCRIPTION OF SOME SPECIFIC EMBODIMENTS

FIG. 1 shows an illustrative but non-restrictive implementation for adata processing system specifically adapted to carry out a methodaccording to the invention. The data processing system shown in FIG. 1comprises a server system 1-100 configured to cooperate with otherservers (internet hosts) and client terminals, which may includecomputers of various type and configuration, tablet computers,smartphones, or the like. By way of example, reference signs CT1, CT2denote two client terminals, which are shown as desktop or laptopcomputers, which access the server computer 1-100 through the internet.Reference signs MT1, MT2 denote two mobile terminals, such assmartphones, tablet computers or the like, which access the servercomputer 1-100 through a wireless access network AN.

The server computer 1-100 comprises one or more central processing unitsCP1 . . . CPn, generally denoted by reference numeral 1-110. Embodimentscomprising multiple processing units 1-110 are preferably provided witha load balancing unit 1-115 that balances processing load among themultiple processing units 1-110. The multiple processing units 1-110 maybe implemented as separate processor components or as physical processorcores or virtual processors within a single component case. The servercomputer 1-100 further comprises a network interface 1-120 forcommunicating with various data networks, which are generally denoted byreference sign DN. The data networks DN may include local-area networks,such as an Ethernet network, and/or wide-area networks, such as theinternet. The server computer 1-100 serves one or more client terminals,and communicates with other servers or hosts, via the data networks DN,a typical example of which is the internet.

The server computer 1-100 of the present embodiment also comprises auser interface 1-140. Depending on implementation, the user interface1-140 may comprise local input-output circuitry for a local userinterface, such as a keyboard, touch screen, mouse and/or display (notshown). Alternatively or additionally, management of the server computer1-100 may be implemented remotely, by utilizing the network interface1-120 and a terminal similar to the work stations WS. The nature of theuser interface depends on which kind of computer is used to implementthe server computer 1-100. If the server computer 1-100 is a dedicatedcomputer, it may not need a local user interface, and the servercomputer 1-100 may be managed remotely, such as from a web browser overthe internet, for example. Such remote management may be accomplishedvia the same network interface 1-120 that the server computer utilizesfor traffic between itself and the client terminals.

The server computer 1-100 of the present embodiment may optionally havea mobile network interface 1-125, in order to communicate with mobileterminals via one or more wireless access networks AN.

The server computer 1-100 also comprises memory 1-150 for storingprogram instructions, operating parameters and variables. Referencenumeral 1-160 de-notes a program suite for the server computer 1-100.

The server computer 1-100 also comprises circuitry for various clocks,interrupts and the like, and these are generally depicted by referencenumeral 1-130. The server computer 1-100 further comprises a diskinterface to the disk system 1-190. The various elements 1-110 through1-150 intercommunicate via a bus 1-105, which carries address signals,data signals and control signals, as is well known to those skilled inthe art.

The one or more client terminals may employ a data processingarchitecture, which is basically similar to that of the server computer,although the client terminals typically require less storage space thanserver computers do.

One of the adaptations of the data processing system 1-100, in order tocarry out the techniques of the invention, include an operative couplingfrom the server computer 1-100 to a database or set of databases,generally denoted by reference number 1-190.

An adaptation of the server computer 1-100, in order to carry out thetechniques of the invention, includes providing one or more of thecomputers, such as the server computer itself, or the client terminals,with program code instructions for instructing the set of processors1-110 to execute the functions of the method according to the inventionand/or its embodiments. Specifically, the functions of the inventivemethod include the acts defined in claim 1.

The embodiment shown in FIG. 1 is by no means exclusive, and otherimplementations are possible. For instance, the database system and thememory system storing program code instructions for causing theprocessing system to carry out the inventive process can be installed inone or more of the client terminals, in which case a separate server isnot necessary for the self-sufficient client terminals.

Referring now to FIG. 2, it is illustrated and described how dynamicalpricing of perishable items of goods is performed according to anembodiment of the invention, related to a method, computer programproduct and system. FIG. 2 shows a governing node, denoted by referencenumber 600, which can be implemented similarly to the server system1-100 shown in FIG. 1.

The governing node 600 in FIG. 2 comprises at least one database 630, acomputing device 650 and data storage 660 and constitutes together withthe client terminals and/or mobile terminals CT1, CT2, MT1, MT2 shown inFIG. 1 a network, which in this aspect is regarded as a virtualmarketplace. Most of the commerce in the virtual marketplace does nottake place physically as in a normal marketplace, like a bazaar or astore where the products are offered to the customers by sales people inthe store, behind stalls or from the shelves by the owner of the store.Instead the customers, or agents acting on their behalf, get access tothe items of goods, or products, for offer typically by logging into aweb page, homepage, or portal, in the “virtual world” in order to getaccess to the information contents of the governing node 600, such asthe products for offer and their price. This can typically be performedby entering and/or selecting the web address, domain name or IP address.A web page is normally accessible from any of the client terminalsand/or mobile terminals CT1, CT2, MT1, MT2 (e.g. a client or acustomer), via a web server where the customer, or client, uses aparticular type of software, typically a so called web browser to accessa web page. The client terminals and/or mobile terminals CT1, CT2, MT1,MT2, such as communication devices used by customers, can interact withthe contents in the governing node 600, for example via the web browser.The browser “reads” the contents of the database 630, or any processedcontents, e.g. processed data, and provides a presentation of thecontents to at least one of the client terminals and/or mobile terminalsCT1, CT2, MT1, MT2. Of course, many other ways of interaction betweenthe nodes and the customers are possible; like the use of be pop-ups,e-mail or SMS-reminders, or the like, moreover today constant access,such as continuous login, is possible all around the world.

The database 630 comprises a readable and writeable register 631, ordata memory, wherein information related to registered items of goods633, in particular perishable items of goods, are stored. The database630 stores the contents (i.e. the registered items of goods 633) forsale offered on the virtual marketplace and updated information relativeto the contents, such as updated prices etc.

The information regarding the items of goods 633 is typically the price,sort or type, time- and date stamps, a related product number, thetotal, or remaining number of items of goods 633, a time parameter (T ort), or any other type of relevant information needed to performcalculations and/or processing as well as storing the information.

The database 630 records each purchase of an item 633 and the relevantinformation associated with it, and the dynamic pricing in connectionwith the computing device 650, which perform relevant calculations suchas to update the price of each item 633 for sale. This updated and therelated information is typically also stored in the database 630. Theprice can be updated for any time period, for example every millisecond,second, minute, hour, day, week, month, and year.

The computing device 650, also referred to as a computer, comprises atleast one processing unit 651, for example a CPU (Central ProcessingUnit), arranged to receive, transmit, route, calculate or processinformation (e.g. data) within the governing node 600. The processingunit 651 is typically directly connected to all other units orcomponents within the governing node 600, such as the database 630, thedata storage 660 and indirectly to all other client terminals and/ormobile terminals CT1, CT2, MT1, MT2 in the network 100 through theirinterfaces, respectively. The computing device 650 can also comprise avariety of other devices responsive to software instructions, ahardwired state device or a combination of these. The computing device650 also comprises a time and datum device 653 for measuring, recordingand synchronizing time and date in the system 100 of FIG. 1, and istypically used to time and date stamp events, such e.g. purchases, in-and/or out-going orders etc., in the system 100, but could also be usedto count down the time before the items of goods 633, becomes useless orexpires.

The data storage 660 comprised in the governing node 600 storescomputer-executable instructions e.g. data programs, machine codes orcomputer software. The data storage 660 comprises a data memory 669, forexample, internal RAM, hard disc, optical disk, USB-stick, or the like,as is well known in the art.

The data storage 660 also resides a first set of computer-executableinstructions 661 comprised in a first data storage segment 662, wherethe first set of computer-executable instructions 661 comprise theinstructions needed to perform all steps of the inventive method fordynamically pricing the items of goods 633, e.g. the products such asperishable goods, and will be described more thoroughly in thisdisclosure of the invention. The purpose of the first set ofcomputer-executable instructions 661 is that the registered items ofgoods 633, such as the products offered for sale on the virtual marketcould be provided, presented, processed and dynamically priced accordingto the method of the invention. These computer-executable instructions661 are also configured to govern components within the governing node600 in order to perform the inventive method by any associated hardwireddesign or computer program product, such as a particular software, butmany other ways are of course conceivable.

The data storage 660 also resides a second set of computer-executableinstructions 663 comprised in a second data storage segment 664, wherethe second set of computer-executable instructions 663 are arranged tocontrol the communication in the system 100 (e.g. the network) betweenthe governing node 600 and the client terminals and/or mobile terminalsCT1, CT2, MT1, MT2. These instructions could also enable securecommunication and generate digital certificates, which preferably areencrypted, compressed and signed. In administrating individual products(i.e. registered items of goods 633), especially if different customers,users or clients are involved, there is certainly a need for a set ofrules which governs and protects information such as credit card andbank account communications and traceability as well as authorizedresponse, hence the digital certificate serves as a key, or as a securecommunication line, for the user. Such certificates could be generatedby the computing device 650 and distributed to the client terminalsand/or mobile terminals CT1, CT2, MT1, MT2. It should be appreciatedthat any, some, or all of the client terminals and/or mobile terminalsCT1, CT2, MT1, MT2, as well as the governing node 600 could comprisecomputer-executable instructions, either hardwired and/or comprised assoftware which allow them to communicate with each other in the systemand over the network.

Furthermore, the data storage 660 comprises a third data storage segment666 comprising a third set of computer-executable instructions 665arranged to control the basic operations of the processor 651. The thirddata storage segment 666 is typically a non-volatile memory and thethird set of computer-executable instruction 665 could for example be anoperative system, the machine code, or firmware of the computing device650 and/or its components.

In this case, the computer-executable instructions 661, 663 and 665 arecomprised in the data storage 660, but could of course also be arrangedin an Internet-application. It is also conceivable that the data storage660 is located at an external location, e.g. distributed in or at theclient terminals and/or mobile terminals CT1, CT2, MT1, MT2.

Further alternatives and combinations of different interfaces,communications protocols, computer-executable instructions, datastorages, communication links etc. required will not be described inmore detail since this is conventional technology and therefore obviousfor a person skilled in the art of electronics and computer science todesign.

Referring now to FIG. 3, an embodiment of a method is illustrated, whichcan be provided by means of the inventive system and computer programproduct described above.

To start, typically initial settings, including the total number ofitems for sale, initial price P₀, begin sale time T₀, end sale timeT_(n), stale quote offer period ΔT_(freeze), update frequency timeperiod ΔT_(update) and minimum price P_(minimum) is set 501. Then saleof goods having a current price P_(current)=P₀ at begin sale time T=T₀begins 503.

Initial settings are set 501, a total number of items of goods 633, inparticular perishable items of goods, are registered in the database 630and offered 503 for sale. The number of perishable items of goods 633offered for sale can be limited. The unique characteristics ofperishable items of goods is that perishable items of goods areproducts, or goods, which value is to deteriorate or decay to the pointof being unserviceable, useless or worthless, and by their very naturecannot be conserved indefinitely. Examples of perishable items of goods633 could be tickets to an event, tickets for travelling, accommodationssuch as hotel rooms, provisions with a best-before-date, and the like.

The items of goods 633 are associated with a begin sale parameter T₀,time parameter T and end of sale parameter T_(n). The time parameter Tis defined as the current time 505. Sale commences when T=T₀, and themaximum point in time the items of goods 633 becomes worthless oruseless is T=T_(n). Some typical examples of when items of goods becomeworthless are concert tickets after the concert has finished, traintickets after departure, the expiry of best-before-date of provisionslike milk, meat, fish in a grocery store or the like. This time couldalso be any point in time the sale ends due to any particularrestriction in time or any other reason. The entire time the items ofgoods 633, i.e. the products, will “live” in this respect is then thetime it will become worthless T_(n) subtracted with the time the salecommenced T₀. Hence T₀≦T≦T_(n) is controlled.

As an illustrative example, assume that the data processing systemstores data concerning a number of (e.g. one hundred) tickets for amusic concert that will occur in one week. The data processing systemdescribed herein will next offer these tickets for sale on the virtualmarket. Each ticket will hence “live” (T_(n)−T₀) one week. Tickets areoffered for sale at time T=T₀. It could be convenient to convertabsolute time (minutes/hours/days, etc.) into relative time, andabsolute volume (number of items of goods sold) into relative volume.Converting absolute time into relative time can be done by firstsubtracting the time when the sale commenced T₀ from the time parameterT. Then the ratio, where the elapsed sales time T−T₀ is placed in thenumerator, and the total sales time T_(n)−T₀ in the denominator, i.e.(T−T₀)/(T_(n)−T₀), varies between 0 to 1, or between 0% to 100%, whichis a convenient way to illustrate how long the items of goods 633 have“lived” or existed, and how much time they have left before they will“perish”. When this ratio equals 1, or 100%, “time's up” for theperishable items of goods 633. After that point in time, the perishableitems of goods 633 are regarded as worthless or significantly lessworth.

The initial price setting 501 is preferably performed by using some sortof price estimation method where information regarding the items ofgoods 633 is used as a basis for that estimation. If there have beensimilar sales situations in the past, these can be used in order toestimate an average historical price and hence the initial price.

If there is historical sales data (time and price for each item sold athand) the average cumulative volume sold as a function of time can beestimated empirically. The shape ACV'(T) of the average cumulativevolume function is determined by estimating the average cumulativevolume sold as a function of time on historical sales data. ACV'(T) canbe linear, exponential, logarithmic or any combination of these, as wellas a plurality of other function types. The average cumulative volumefunction ACV(t) is then determined by calibrating ACV'(T) so that itresults in 100% of the items being sold when 100% when time is up(T=T_(n)).

According to an embodiment of the present invention, a time parameter Tis controlled 505. Next, if the time parameter T≦T_(n) 507, then anupdate frequency time period ΔT_(update) is counted down 511 until theprice is updated. When a potential buyer ask for a quote, a frozen(temporarily locked) price P_(freeze) is offered 509 for a strictlylimited time ΔT_(freeze). The current price P_(current), which isoffered to other buyer is then instantaneously updated, in order toreflect the potential buyers' interest.

If an order to buy the item of goods is received 515 before end of thelimited time ΔT_(freeze), the order is accepted 517. The order isrejected 521 if the order is received after 515 the limited time periodΔT_(freeze) has elapsed. In the exemplary flowchart FIG. 3, theΔT_(freeze) is initially set to a positive value, from which it isdecremented until it reaches zero or a negative value, by which time theorder will be rejected.

The current price P_(current) of the item of goods is automaticallyupdated 513 in accordance with a time of offering price as fixed price509, elapsing of update frequency time period ΔT_(update) 511, and timeof receiving order 517 to buy the goods, and the steps above areautomatically repeated until the time parameter T equals the time forend sale parameter T_(n) 507.

The price function which in one embodiment of the invention willcalculate the dynamic price of the perishable items of goods 633 isgiven below.

P _(current)=α*CV(T)/ACV(T)*(β*P ₀Σ[γ_(T-π) *P _(T-π)])

The coefficient α is set according to how aggressively the seller wantsthe price to change. The coefficient α can be a constant, for instanceone. The coefficient α can also be defined as a function of time T andcumulative volume CV(T), etc. Coefficient β determines how much theinitial price P₀ is weighted when calculating the current priceP_(current). Coefficients γ_(T-π) determine how much the correspondingtime T−π prices P_(T-π) are weighted when calculating the current priceP_(current). Typically 1≦π≦T and β+Σ[γ_(T-π)]=1. By inserting thecurrent time T into the average cumulative volume (ACV) sold as afunction of time, the data processing system can output an estimate ofhow many items of goods 633 should have been sold in order for exactlyall the items of goods to be sold at t_(n).

To illustrate how a dynamic price is set, consider equation 1 above, ascan be seen in FIG. 4. Here CV(T) is the cumulative volume, that is howmany items of goods 633 that have been sold at time T. If CV(T)>ACV(T)then the current price P_(current) would typically be higher than theinitial price P₀. If CV(T)<ACV(T) then the current price P_(current)would typically be lower than the initial price P₀.

The initial price P₀ is typically set to the price that is estimated toexactly sell out the maximum cumulative volume of the perishable goodsMAX(CV) by end time T_(n). To illustrate this further, assume the salebegins at time initial time T₀ with initial price P₀, which is theseller's best estimate for a price that will sell exactly all of theperishable goods MAX(CV). The initial price P₀ would hence typicallycorrespond to an ex-ante estimated fixed price. Also, a minimum priceP_(minimum) is set, which for instance could equal to the marginaldelivery cost for one unit of the perishable goods in question.

At a time T=T₁ cumulative volume CV(T₁), i.e. the dotted line in FIG. 4,has been quoted or sold. By inserting T₁ into the average cumulativevolume function ACV(T₁), i.e. the solid line in FIG. 4, we get anestimate of how many items of goods should have been sold at time T=T₁in order for exactly the maximum cumulative volume MAX(CV) to be sold bytime T=T_(n). The price P₁ at time T=T₁ is set to:

P ₁ =α*CV(T ₁)/ACV(T ₁)*(β*P ₀+γ₀ *P ₀)

where P₀ is the initial price at initial time T=T₀. Typically, P₁>P₀ inthe example illustrated in FIG. 4.

A reference is now made to FIG. 5. At a second time T=T₂, a secondcumulative volume CV(T₂) has been quoted or sold, i.e. the dotted linein FIG. 5. The price P₂ at time T=T₂ is now set to:

P ₂ =α*CV(T₂)/ACV(T ₂)*(β*P ₀+γ₀ *P ₀+γ₁ *P ₁)

Typically, P₂<P₀ in the example illustrated in FIG. 5.

Selling ends when the items of goods, i.e. product perishes at timeT=T_(n). The price database contains a complete history of sales price,volume and time, which can be used in order to estimate an averagevolume function for another product at another occasions.

Thus, as could be concluded from the above, the dynamic method fordynamically pricing perishable items of goods will update the dynamicprice for every moment in time so that exactly all of the items of goodsare expected to be sold at the highest possible average price before thepoint in time any remaining items of goods become worthless. However theprice of any individual item should always be higher than or equal tothe marginal costs which the seller incurs as a consequence of sellingthe item.

Although important, the estimation of the cumulative volume functionACV(T) in comparison with the method for dynamically pricing is ofsecondary importance since the method for dynamically pricing will veryrapidly update any errors in the average cumulative volume functionACV(T) due to the continuous information flow in the system once thesale has commenced, and will correlate this information with any dataregistered in the database 630 for the particular sales situation athand.

Once the initial price of the items of goods 633 is set, communicated(e.g. presented at the homepage, or broadcasted to the nodes in thesystem) on the virtual market, the algorithms for the dynamical pricingmethod determined and the commence starts, this price is continuouslyupdated as a dynamic price. If a customer (e.g. a node in the system)initiates a request to order, “quote”, the dynamic price is presented asa temporary frozen price during a limited time period ΔT_(freeze).

Typically, according to an embodiment of the present invention, a fixedprice P_(freeze) is offered for a maximum number of items V_(quote)during a limited interval of time ΔT_(freeze) for each customer session(or demand). The current price P_(current) is also updated while thedynamic price is presented as a temporary frozen price P_(freeze) duringa limited time period ΔT_(freeze), as if the customer would havepurchased the quoted items. If the price is confirmed by the customerwithin the time period ΔT_(freeze), the order is accepted, otherwise, anew price, equal to the current price P_(current), offered is presentedto the customer having a new ΔT_(freeze). This provides more efficientpricing since it hinders customers from locking in an artificially lowaverage price by asking for a large number of frozen prices without thecurrent price P_(current) reacting to this.

One preferred aspect of the invention is to dynamically update the priceof the items of goods 633 in accordance to the real demand in thevirtual market with the objective of selling all of the items of goods633 for sale before the point in time any remaining items of goodsbecome worthless. Thus there is a given inventory of items of goods 633to be sold out before T=T_(n). This is typically also combined with amechanism to restrict the possibility to order all, or a large number,of the items of goods 633 offered for sale during at least one occasion,since it would otherwise be possible to order all of the items of goods633 when the price is favorable and then in turn offer them for sale ona secondary market. The possibility to order items of goods 633 is thusonly valid for a certain volume at one time; and even if this might beseen as a small detail, it is in fact a crucial feature of the inventionsince this will introduce regulated liquidity on the virtual marketwhich reduces the risk of secondary markets to arise.

Therefore the total number of items of goods 633 offered for sale isdivided into parts and offered to the customers in the virtual market insuch parts. Each such part will for convenience hereafter be called apackage which is a particular subset of all the items of goods 633registered in the database 630. Hence, the maximum numbers of items ofgoods 633 an interested customer can order at a single occasion are thenumber of items of goods 633 in a single package during the limited timeΔT_(freeze).

If at least one of the items of goods 633 in one such package is ordered517 during that particular limited time ΔT_(freeze) 515, the dynamicprice is updated 513 immediately in the system for other customers whohave not initiated a request to order.

The dynamic price is also updated 513 when a fixed price is offered 509,when the time interval update ΔT_(update) has elapsed 511, and when anorder is rejected 521. Hence, the dynamic price is updated 513 whenthere is a frozen quote 509, an accepted order 517, a rejected order521, and when time elapses 511.

It is also preferred to emphasize that the invention makes use of bothinformation given every time there is a sale as well as when there is nosale. In both cases the dynamic price converges towards the real demandfor the particular sale situation at hand. In the first case, i.e. whenthere is sale, the dynamic price will normally increase in order tolower the demand, and in the second case, i.e. when there is no sale,the dynamic price will normally decrease in order to stimulate thedemand.

The activity on the virtual market is also of high interest. If, forexample a lot of customers visit the homepage (e.g. found out byanalyzing the number of IP addresses logged in) but do not order anyitem 633, this is typically also important information, since a highactivity at the homepage but low or no request of orders indicates thatthe time interval update ΔT_(update) typically should be decreased inorder to stimulate the demand. If there is low activity, e.g. during thenight, the time interval update ΔT_(update) may be prolonged between theupdates since the decrease of the dynamic price could otherwise be toorapid. Another way to tackle this problem could be that the dynamicalprice is not allowed to decrease below a certain threshold value, whichfor example could be determined by the margin costs of the items ofgoods 633. From the IP addresses the system can estimate how manycustomers that are logged-in, and could automatically change the lengthof the time interval update ΔT_(update) or other essential parameters inaccordance with that information.

To illustrate the feature of the invention that restricts thepossibility to order a large or high volume of items of goods 633 duringone or a few successive number of occasions, assume the one hundredtickets mentioned as an example above are split into packages of forexample five tickets each. The number of packages offered for sale onthe virtual market simultaneously will hence be twenty. Once a customer,who typically is logged in on the homepage has initiated a request toorder at least one ticket (i.e. an item 633), for example by pushing a“QUOTE-button”, or the similar, the dynamic price is temporarily frozenfor that customer during the time slot ΔT_(freeze). By this is meantthat the price is fixed at a particular level during that time slotΔT_(freeze) for that specific customer. This temporary frozen price is asnap-shot of the dynamic price at that instant and it is held during thetime slot ΔT_(freeze), but the dynamic price is continuously computed bythe computing device as a response of the demand, both fixed pricequotes 509 and accepted orders 517, and rejected orders 521 on thevirtual market. Hence, the dynamic price is immediately updated inaccordance with a temporarily frozen dynamic price and volume beingoffered 509 to a customer. This difference could for example bepresented to the customers in two different windows on the homepage,where typically also information regarding how much time is left for thetemporarily frozen price ΔT_(freeze) 515 is displayed for thespecifically offered frozen dynamic price, for example in a window withthe text “now there is only x seconds left to order for this frozendynamic price”. Temporarily freezing the dynamic price makes it possiblefor the customer, once he or she has initiated a request to order, toenter specific details associated with the order like, for example, thenumber of tickets (i.e. items of goods 633) wanted, a credit cardnumber, home address, email address, telephone number, bank details,etc., without risk that the dynamic price will change while enteringsuch details to the seller. If a smaller amount of tickets is ordered bya customer, for example only two tickets in the offered package of five,the dynamic price is updated 513 in the system in accordance with thatan order of two tickets is accepted 517 and an order of three tickets isrejected 521. If other customers have initiated an order 509, they couldsee this updated dynamic price 513, but their temporarily fixed price isstill valid during their individually associated time slot ΔT_(freeze)515.

Even if the twenty packages are offered on the virtual marketsimultaneously it is only possible for one single customer to order amaximum of one package (comprising five tickets) for the, at thatinstant, offered price during the time slot ΔT_(freeze) 515. Thecustomer's ID is typically confirmed in some way by the system where thecustomer's IP-address associated with his device is one obviousalternative. Typically, the first order influences the price of thesecond order even if they arrive very close in time to each other.

As already indicated this feature of the invention will make it harderfor wholesalers to make profits on a secondary market by buying all or alarge number of the items of goods 633. For example, all or a largenumber of the tickets to a music concert with a famous artist, or apopular sports event, and hold on them until just days or even hoursbefore the event is about to occur in order to maximize the profit forthemselves.

The following example illustrates one aspect of dealing with delayedbuying orders of the invention. Assume the commence starts at time12:00:00 for the initial price 100 USD. One package comprises five itemsof goods, the update time period ΔT_(update) 511 is five seconds and thedynamic price is updated 513 after the update time period ΔT_(update)has elapsed 511, and at every temporarily fixed quote 509, acceptedorder 517, and rejected order 521. The limited frozen price time periodΔT_(freeze) 515 is set to two seconds, which means that orders areaccepted up to two seconds after the dynamic price has been quoted to acustomer as a fixed price.

12:00:00 The sale begins.

12:00:01 Two items of goods are quoted to a customer at a temporarilyfixed price 509 of 100 USD each. The dynamic price is updated 513 to 105USD.

12:00:03 An order of two items of goods 633 for 100 USD each is receivedwithin ΔT_(freeze) 515 and accepted 517. The dynamic price is updated513 to 110 USD.

12:00:08 Five seconds ΔT_(update) 511 elapse without quotes or sales.The dynamic price is updated 513 to 105 USD

12:00:10 Four items of goods are quoted 509 to a customer at 105 USDeach. The dynamic price is updated 513 to 115 USD

12:00:12 No order is received within ΔT_(freeze) 515 and the quoted fouritems are hence rejected 521. The dynamic price is updated 513 to 105USD.

12:00:17 Five seconds ΔT_(update) 511 elapse without quotes or sales.The dynamic price is updated 513 to 100 USD.

Those skilled in the art will realize that the inventive principle maybe modified in various ways without departing from the spirit and scopeof the present invention. For instance, the virtual market could also beany physical market offering perishable goods as well, such as foodarticles in a grocery store, a shop, warehouse etc. Any of the nodes inthe virtual market could also in some way be closer associated with aphysical market. A node could for example be at least one physicalstationary cash register disposed at any store (products, food), hotelcheck-in desk, a movie theatre, zoo, museum, gallery, amusement park, oralike.

1. A method comprising: performing a pricing process for perishablegoods on a programmed data processing apparatus, wherein the programmeddata processing apparatus comprises a memory system for storing programcode instructions and data, a processing system configured to execute atleast some of the program code instructions and to process the datastored in the memory system, and wherein the processing system isoperatively coupled to a database system, wherein the database systemstores information on a plurality of items of goods, wherein the memorysystem comprises program code instructions for causing the processingsystem to carry out the pricing process, wherein the pricing processcomprises the following acts for each of a plurality of items of goods:a) monitoring a time parameter T corresponding to the time period fromT₀ to T_(n) when an item of goods is good for sale, and if the timeparameter T<T_(n); b) periodically updating a current price P_(current)for the item of goods at every predetermined time interval todynamically reflect potential buyers' interests, based on an estimationof how many items of goods should have been sold in order for exactlyall of the items of goods to be sold at the highest possible averageprice before T_(n), and a real demand for an ongoing sale situationafter commerce starts; c) producing a virtual marketplace displaying ina general buyer interface information of the item of goods including theperiodically updated current price P_(current) viewable by buyersthrough buyer terminals connected to the virtual marketplace via anetwork; d) setting a maximum number of items V_(quote) for the buyersindicating a maximum number of items of goods purchasable by each buyerduring a freeze time period ΔT_(freeze), V_(quote) being equal to orsmaller than a maximum cumulative volume of the perishable goodsMAX(CV); e) receiving an indication of interest to buy at least one itemof goods from a particular buyer through one of the buyer terminalsinteracting with the virtual marketplace; f) in response to receivingthe indication of interest to buy the at least one item of goods,generating a buyer specific buyer interface associated with the time ofreceiving the indication of interest, displaying in the buyer specificbuyer interface a temporarily fixed price P_(freeze) equal to currentprice P_(current) for the freeze time period ΔT_(freeze), viewablethrough the buyer terminal by said particular buyer that indicated theinterest to buy the at least one item of goods; g) automaticallyupdating the current price P_(current) in response to offering atemporarily fixed price P_(freeze), taking into consideration theindication of interest, and displaying in the general buyer interfacethe updated current price P_(current) viewable by buyers through buyerterminals connected to the virtual marketplace; h) keeping periodicallyupdating the current price P_(current) for the item of goods displayedin the general buyer interface while keeping the temporarily fixed priceP_(freeze) displayed in the buyer specific buyer interface unchangedduring the freeze time period ΔT_(freeze); i) accepting a purchase orderfor the at least one item of goods at the temporarily fixed priceP_(freeze) if a number of the at least one item of goods of the purchaseorder is equal to or smaller than the maximum number of items V_(quote)for the particular buyer and the purchase order is received within thefreeze time period ΔT_(freeze) from the buyer terminal interacting withthe displayed item of goods in the virtual marketplace; j) rejecting thepurchase order if the number of the at least one item of goods of thepurchase order exceeds the maximum number of items V_(quote) for theparticular buyer; k) rejecting the purchase order if the purchase orderis received after the freeze time period ΔT_(freeze); l) automaticallyupdating the current price P_(current) of the item of goods in responseto receiving an accepted and/or rejected order and displaying in thegeneral buyer interface the updated current price P_(current) viewableby buyers through buyer terminals connected to the virtual marketplace;and automatically repeating the acts b) through l) until the timeparameter T equals the maximum time T_(n).
 2. The method according toclaim 1, further comprising the step of: displaying information in thebuyer specific buyer interface regarding how much time is left of thefreeze time period ΔT_(freeze).
 3. The method according to claim 1, theact l) further comprising: automatically updating the maximum number ofitems V_(quote) for the buyers in response to receiving the acceptedand/or rejected order.
 4. The method according to claim 1, furthercomprising the step of: setting initial settings, including initialprice P₀, update frequency time period ΔT_(update), beginning of saletime T₀, end of sale time T_(n).
 5. The method according to claim 1,further comprising the steps of: offering a temporarily fixed priceP_(freeze) equal to current price P_(current) for a limited time periodΔT_(freeze) and updating the current price P_(current) accordingly, andaccepting an order if freeze time period ΔT_(freeze)>0 and updating thecurrent price P_(current) accordingly.
 6. The method according to claim4, wherein the initial price P₀ is set to the highest price that willsell the maximum cumulative volume of the perishable goods MAX(CV) attime T=T_(n).
 7. The method according to claim 4, wherein a minimumprice Pminimum is set.
 8. The method according to claim 7, furthercomprising the step of: estimating and setting the minimum pricePminimum as a function of the time parameter T.”
 9. The method accordingto claim 5, further comprising the step of: inserting time T=T1 into anaverage cumulative volume function ACV(T) to estimate how many items ofgoods should have been sold in order for exactly the maximum cumulativevolume MAX(CV) to be sold at time T=Tn, based on cumulative volumeCV(T1) that has been sold at time T1.
 10. The method according to claim9, wherein in case of no new sale, after a predetermined time interval,inserting time T=T₂ into the average cumulative volume function ACV(T₂)to estimate how many items of goods should have been sold in order forexactly the maximum cumulative volume MAX(CV) to be sold at time T=Tn,based on cumulative volume CV(T2) that has been sold at time T2.
 11. Anon-transitory computer-readable medium comprising program codeinstructions for a data processing apparatus, wherein execution of theprogram code instructions causes the data processing apparatus toperform the acts of: performing a pricing process for perishable goodson a programmed data processing apparatus, wherein the programmed dataprocessing apparatus comprises a memory system for storing program codeinstructions and data, a processing system configured to execute atleast some of the program code instructions and to process the datastored in the memory system, and wherein the processing system isoperatively coupled to a database system, wherein the database systemstores information on a plurality of items of goods, wherein the memorysystem comprises program code instructions for causing the processingsystem to carry out the pricing process, wherein the pricing processcomprises the following acts for each of a plurality of items of goods:a) monitoring a time parameter T corresponding to the time period fromT₀ to T_(n) when an item of goods is good for sale, and if the timeparameter T<T_(n); b) periodically updating a current price P_(current)for the item of goods at every predetermined time interval todynamically reflect potential buyers' interests, based on an estimationof how many items of goods should have been sold in order for exactlyall of the items of goods to be sold at the highest possible averageprice before T_(n), and a real demand for an ongoing sale situationafter commerce starts; c) producing a virtual marketplace displaying ina general buyer interface information of the item of goods including theperiodically updated current price P_(current) viewable by buyersthrough buyer terminals connected to the virtual marketplace via anetwork; d) setting a maximum number of items V_(quote) for the buyersindicating a maximum number of items of goods purchasable by each buyerduring a freeze time period ΔT_(freeze), V_(quote) being equal to orsmaller than a maximum cumulative volume of the perishable goodsMAX(CV); e) receiving an indication of interest to buy at least one itemof goods from a particular buyer through one of the buyer terminalsinteracting with the virtual marketplace; f) in response to receivingthe indication of interest to buy the at least one item of goods,generating a buyer specific buyer interface associated with the time ofreceiving the indication of interest, displaying in the buyer specificbuyer interface a temporarily fixed price P_(freeze) equal to currentprice P_(current) for the freeze time period ΔT_(freeze), viewablethrough the buyer terminal by said particular buyer that indicated theinterest to buy the at least one item of goods; g) automaticallyupdating the current price P_(current) in response to offering atemporarily fixed price P_(freeze), taking into consideration theindication of interest, and displaying in the general buyer interfacethe updated current price P_(current) viewable by buyers through buyerterminals connected to the virtual marketplace; h) keeping periodicallyupdating the current price P_(current) for the item of goods displayedin the general buyer interface while keeping the temporarily fixed priceP_(freeze) displayed in the buyer specific buyer interface unchangedduring the freeze time period ΔT_(freeze); i) accepting a purchase orderfor the at least one item of goods at the temporarily fixed priceP_(freeze) if a number of the at least one item of goods of the purchaseorder is equal to or smaller than the maximum number of items V_(quote)for the particular buyer and the purchase order is received within thefreeze time period ΔT_(freeze) from the buyer terminal interacting withthe displayed item of goods in the virtual marketplace; j) rejecting thepurchase order if the number of the at least one item of goods of thepurchase order exceeds the maximum number of items V_(quote) for theparticular buyer; k) rejecting the purchase order if the purchase orderis received after the freeze time period ΔT_(freeze); l) automaticallyupdating the current price P_(current) of the item of goods in responseto receiving an accepted and/or rejected order and displaying in thegeneral buyer interface the updated current price P_(current) viewableby buyers through buyer terminals connected to the virtual marketplace;and automatically repeating the acts b) through l) until the timeparameter T equals the maximum time Tn.
 12. A system comprising: aprogrammed data processing apparatus, wherein the programmed dataprocessing apparatus comprises a memory system for storing program codeinstructions and data, a processing system configured to execute atleast some of the program code instructions and to process the datastored in the memory system, and wherein the processing system isoperatively coupled to a database system, wherein the database systemstores information on a plurality of items of goods, wherein the memorysystem comprises program code instructions for causing the processingsystem to carry out the pricing process, wherein the pricing processcomprises the following acts for each of a plurality of items of goods:wherein the memory system comprises program code instructions forcausing the processing system to carry out the pricing process, whereinthe pricing process comprises the following acts for each of a pluralityof items of goods: a) monitoring a time parameter T corresponding to thetime period from T₀ to T_(n) when an item of goods is good for sale, andif the time parameter T<T_(n); b) periodically updating a current priceP_(current) for the item of goods at every predetermined time intervalto dynamically reflect potential buyers' interests, based on anestimation of how many items of goods should have been sold in order forexactly all of the items of goods to be sold at the highest possibleaverage price before T_(n), and a real demand for an ongoing salesituation after commerce starts; c) producing a virtual marketplacedisplaying in a general buyer interface information of the item of goodsincluding the periodically updated current price P_(current) viewable bybuyers through buyer terminals connected to the virtual marketplace viaa network; d) setting a maximum number of items V_(quote) for the buyersindicating a maximum number of items of goods purchasable by each buyerduring a freeze time period ΔT_(freeze), V_(quote) being equal to orsmaller than a maximum cumulative volume of the perishable goodsMAX(CV); e) receiving an indication of interest to buy the at least oneitem of goods from a particular buyer through one of the buyer terminalsinteracting with the virtual marketplace; f) in response to receivingthe indication of interest to buy the at least one item of goods,generating a buyer specific buyer interface associated with the time ofreceiving the indication of interest, displaying in the buyer specificbuyer interface a temporarily fixed price P_(freeze) equal to currentprice P_(current) for the freeze time period ΔT_(freeze), viewablethrough the buyer terminal by said particular buyer that indicated theinterest to buy the at least one item of goods; g) automaticallyupdating the current price P_(current) in response to offering atemporarily fixed price P_(freeze), taking into consideration theindication of interest, and displaying in the general buyer interfacethe updated current price P_(current) viewable by buyers through buyerterminals connected to the virtual marketplace; h) keeping periodicallyupdating the current price P_(current) for the item of goods displayedin the general buyer interface while keeping the temporarily fixed priceP_(freeze) displayed in the buyer specific buyer interface unchangedduring the freeze time period ΔT_(freeze); i) accepting a purchase orderfor the at least one item of goods at the temporarily fixed priceP_(freeze) if a number of the at least one item of goods of the purchaseorder is equal to or smaller than the maximum number of items V_(quote)for the particular buyer and the purchase order is received within thefreeze time period ΔT_(freeze) from the buyer terminal interacting withthe displayed item of goods in the virtual marketplace; j) rejecting thepurchase order if the number of the at least one item of goods of thepurchase order exceeds the maximum number of items V_(quote) for theparticular buyer; k) rejecting the purchase order if the purchase orderis received after the freeze time period ΔT_(freeze); l) automaticallyupdating the current price P_(current) of the item of goods in responseto receiving an accepted and/or rejected order and displaying in thegeneral buyer interface the updated current price P_(current) viewableby buyers through buyer terminals connected to the virtual marketplace;and automatically repeating the acts b) through l) until the timeparameter T equals the maximum time Tn.
 13. The method according toclaim 2, the act l) further comprising: automatically updating themaximum number of items Vquote for the buyers in response to receivingthe accepted and/or rejected order.
 14. The method according to claim 2,further comprising the step of: setting initial settings, includinginitial price P0, update frequency time period ΔTupdate, beginning ofsale time T0, end of sale time Tn.
 15. The method according to claim 3,further comprising the step of: setting initial settings, includinginitial price P₀, update frequency time period ΔT_(update), beginning ofsale time T₀, end of sale time Tn.
 16. The method according to claim 2,further comprising the steps of: offering a temporarily fixed pricePfreeze equal to current price Pcurrent for a limited time periodΔTfreeze and updating the current price Pcurrent accordingly, andaccepting an order if freeze time period ΔTfreeze>0 and updating thecurrent price Pcurrent accordingly.
 17. The method according to claim 3,further comprising the steps of: offering a temporarily fixed priceP_(freeze) equal to current price P_(current) for a limited time periodΔT_(freeze) and updating the current price P_(current) accordingly, andaccepting an order if freeze time period ΔT_(freeze)>0 and updating thecurrent price P_(current) accordingly.